Counting points and acquiring flesh
نویسندگان
چکیده
منابع مشابه
Counting Function Points for
Function points (FPs) are proven to be effective and efficient units of measure for both agile/iterative and waterfall software deliveries. However, inconsistencies come to light when comparing FPs counted in agile/iterative development with those counted in waterfall or combination development – and those inconsistencies can create confusion for cost, productivity, and schedule evaluations tha...
متن کاملCounting Lattice Points in Polyhedra
We present Barvinok’s 1994 and 1999 algorithms for counting lattice points in polyhedra. 1. The 1994 algorithm In [2], Barvinok presents an algorithm that, for a fixed dimension d, calculates the number of integer points in a rational polyhedron. It is shown in [6] and [7] that the question can be reduced to counting the number of integer points in a k-dimensional simplex with integer vertices ...
متن کاملCounting Rational Points on Hypersurfaces
For any n ≥ 2, let F ∈ Z[x1, . . . , xn] be a form of degree d ≥ 2, which produces a geometrically irreducible hypersurface in P. This paper is concerned with the number N(F ; B) of rational points on F = 0 which have height at most B. For any ε > 0 we establish the estimate N(F ; B) = O(B), whenever either n ≤ 5 or the hypersurface is not a union of lines. Here the implied constant depends at ...
متن کاملUniversal Counting of Lattice Points in Polytopes
Given a lattice polytope P (with underlying lattice L), the universal counting function UP (L ) = |P ∩ L| is defined on all lattices L containing L. Motivated by questions concerning lattice polytopes and the Ehrhart polynomial, we study the equation UP = UQ. Mathematics Subject Classification: 52B20, 52A27, 11P21 Partially supported by Hungarian Science Foundation Grant T 016391, and by the Fr...
متن کاملCounting Points on Curves over Finite Fields
Stanford University) Abstract: A curve is a one dimensional space cut out by polynomial equations, such as y2=x3+x. In particular, one can consider curves over finite fields, which means the polynomial equations should have coefficients in some finite field and that points on the curve are given by values of the variables (x and y in the example) in the finite field that satisfy the given polyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Innovations in Incidence Geometry: Algebraic, Topological and Combinatorial
سال: 2017
ISSN: 1781-6475,1781-6475
DOI: 10.2140/iig.2017.15.229